On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities
نویسندگان
چکیده
Projection type methods are among the most important methods for solving monotone linear variational inequalities. In this note, we analyze the iteration complexity for two projection methods and accordingly establish their worst-case O(1/t) convergence rates measured by the iteration complexity in both the ergodic and nonergodic senses, where t is the iteration counter. Our analysis does not require any error bound condition or the boundedness of the feasible set, and it is scalable to other methods of the same kind.
منابع مشابه
Projected Reflected Gradient Methods for Monotone Variational Inequalities
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the ...
متن کاملGeneralized Projection Method for Non-lipschitz Multivalued Monotone Variational Inequalities
We generalize the projection method for solving strongly monotone multivalued variational inequalities when the cost operator is not necessarily Lipschitz. At each iteration at most one projection onto the constrained set is needed. When the convex constrained set is not polyhedral, we embed the proposed method in a polyhedral outer approximation procedure. This allows us to obtain the projecti...
متن کاملA Modified Forward - Backward Splitting Methodfor Maximal Monotone
We consider the forward-backward splitting method for nding a zero of the sum of two maximal monotone mappings. This method is known to converge when the inverse of the forward mapping is strongly monotone. We propose a modiication to this method, in the spirit of the extragradient method for monotone variational inequalities, under which the method converges assuming only the forward mapping i...
متن کاملA descent alternating direction method for monotone variational inequalities with separable structure
To solve a special class of variational inequalities with separable structure, this paper proposes a descent alternating direction method based on a new residual function. The most prominent characteristic of the method is that it is easily performed, in which, only some orthogonal projections and function evaluations are involved at each iteration, so its computational load is very tiny. Under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Optimization Theory and Applications
دوره 172 شماره
صفحات -
تاریخ انتشار 2017